Investigating the Detrimental Outcomes of Malicious Activities in the Academic College Libraries

Academic libraries play a key role in encouraging literacy and cultural interest in students, staff and the community. In the present-day world, theft and vandalism has become very common and a severe problem in academic college libraries. This research paper mainly deals with work of the library professionals in investigating the book theft, vandalism, mutilation activities, and planning polices to control these malicious activities. A structured online questionnaire was prepared for the college librarians to the gather data for the research study. The research data was collected from forty library professionals. Insufficient copies of text books are the main cause for vandalism agreed upon by the majority 85% of the respondents. 80% of the library professionals mentioned to have CCTV installation which can reduce malpractices in the libraries As per the research study 100% of respondents agree that by conducting orientation program, checking the requirements of the patrons, providing the necessary resources required by them, by using wire mesh for windows and having a single way for entry and exit will help in combating vandalistic activities in the academic libraries. This study will also help the library professionals as well as the patrons to preserve and guard invaluable academic wealth of libraries for potential generations

A Study on Advanced Cross Site Request Forgery Attacks and its Prevention

Cross Site Request Forgery (CSRF) is considered as one of the top vulnerability in today’s network where an untrusted website can force the client browser to send the unauthorized valid appeal to the trusted site. Cross Site Request Forgery will let the trustworthiness of the authentic customer.So far, numerous arrangements have been proposed for the CSRF assaults, for example, the referrer HTTP header, custom HTTP header, origin header, customer site intermediary, browser module and random token affirmation. In any case, existing arrangements isn't so insusceptible as to maintain a strategic distance from this assault. Each one of the arrangements is mostly ensured as it were. This study centers around portraying the execution of various conceivable cross site demand imitation strategies and depicting the entanglements in the assortment of preventive systems of cross site demand falsification thus we proposed some barrier instrument to avoid this defenselessness

Some remarks on a new exotic spacetime for time travel by free fall

This work is essentially a review of a new spacetime model with closed causal curves, recently presented in another paper (Class. Quantum Grav. \textbf{35}(16) (2018), 165003). The spacetime at issue is topologically trivial, free of curvature singularities, and even time and space orientable. Besides summarizing previous results on causal geodesics, tidal accelerations and violations of the energy conditions, here redshift/blueshift effects and the Hawking-Ellis classification of the stress-energy tensor are examined.Comment: 17 pages, 9 figures. Submitted as a contribution to the proceedings of "DOMOSCHOOL - International Alpine School of Mathematics and Physics, Domodossola 2018". Possible text overlaps with my previous work arXiv:1803.08214, of which this is essentially a review. Additional results concerning redshift/blueshift effects and the classification of the stress-energy tensor are presented her

Improved algorithms for online load balancing

We consider an online load balancing problem and its extensions in the framework of repeated games. On each round, the player chooses a distribution (task allocation) over $K$ servers, and then the environment reveals the load of each server, which determines the computation time of each server for processing the task assigned. After all rounds, the cost of the player is measured by some norm of the cumulative computation-time vector. The cost is the makespan if the norm is $L_\infty$-norm. The goal is to minimize the regret, i.e., minimizing the player's cost relative to the cost of the best fixed distribution in hindsight. We propose algorithms for general norms and prove their regret bounds. In particular, for $L_\infty$-norm, our regret bound matches the best known bound and the proposed algorithm runs in polynomial time per trial involving linear programming and second order programming, whereas no polynomial time algorithm was previously known to achieve the bound.Comment: 16 pages; typos correcte

A Proposed Secured Prediction System for Human Diseases Using a Genetic Algorithm Approach to Data Mining

Many changes are happening in life styles of people in growing countries like India in recent days. Such changes in environment, diet, pollution and stress have led to the scenario that human beings are affected by microorganisms causing fatal diseases. In India, human diseases have become a major reason of deaths. A number of people have worked in this area to detect a particular disease, but it may happen that a person may be suffering from more than one disease at a time. Our attempt therefore is to detect the diseases a patient is suffering from with the use of detail symptoms given by a patient regarding his health status. This detection will enable him to have an appropriate treatment in time.In the health sector Data Mining techniques can be used to play a major role to detect a disease. The aim of the proposed system is to predict human diseases by using Association Rule Mining Algorithm name Apriori and generating optimized association rules using a Genetic Algorithm.

On multi-scale asymptotic structure of eigenfunctions in a boundary value problem with concentrated masses near the boundary

We construct two-term asymptotics ?? k = ?m?2(M + ??k + O(?3/2)) of eigenvalues of a mixed boundary-value problem in ? R2 with many heavy (m > 2) concentrated masses near a straight part of the boundary ? . ? is a small positive parameter related to size and periodicity of the masses; k ? N. The main term M > 0 is common for all eigenvalues but the correction terms ?k , which are eigenvalues of a limit problem with the spectral Steklov boundary conditions on , exhibit the effect of asymptotic splitting in the eigenvalue sequence enabling the detection of asymptotic forms of eigenfunctions. The justification scheme implies isolating and purifying singularities of eigenfunctions and leads to a new spectral problem in weighed spaces with a "strongly" singular weight.This research work has been partially supported by Spanish MINECO, MTM2013-44883-P. Also, the research work of the first author has been partially supported by Russian Foundation of Basic research (project 15–01–02175)

Classical and semi-classical energy conditions

The standard energy conditions of classical general relativity are (mostly) linear in the stress-energy tensor, and have clear physical interpretations in terms of geodesic focussing, but suffer the significant drawback that they are often violated by semi-classical quantum effects. In contrast, it is possible to develop non-standard energy conditions that are intrinsically non-linear in the stress-energy tensor, and which exhibit much better well-controlled behaviour when semi-classical quantum effects are introduced, at the cost of a less direct applicability to geodesic focussing. In this article we will first review the standard energy conditions and their various limitations. (Including the connection to the Hawking--Ellis type I, II, III, and IV classification of stress-energy tensors). We shall then turn to the averaged, nonlinear, and semi-classical energy conditions, and see how much can be done once semi-classical quantum effects are included.Comment: V1: 25 pages. Draft chapter, on which the related chapter of the book "Wormholes, Warp Drives and Energy Conditions" (to be published by Springer), will be based. V2: typos fixed. V3: small typo fixe

Kill Switch for a Bike to Create and Develop a Smart Switch for Advanced Protection of Bike

Internet of things is interconnection of physical devices, vehicles, home appliances, and other deviceswhich are with electronics functionality, software, sensors, actuators, and connectivity which connection among these and exchange of data. It is the concept which enables to connect different devices to the internet and also to other connected devices. It is a massive network of connected objects and people, where all of them collect and share data about the environment and conditionsaround them. It includes various number of objects having different kinds and aspects- like smart microwaves, which automatically cook your food for the perfect amount of time, to self-driving cars, whose high level sensors detectpath and obstacles in that path, to the fitness devices which measure your heartbeat rate, measures the calories burnt and the amount of steps you’ve taken that day, then use all that information to suggest exercise plans suitable to you. The main aim of our study is to give advanced protection to a vehicle, if we are in heavy parking zone then we have big problems to find our bike so, it will be easy by featuring the engine ON/OFF using a switch; it is a combination of Arduino, GPS and GSM module and RFID which is controlled using app. In this study, we have proposed to use Arduino UNO. It is the main part of the whole circuit. It processes all the data and controls all the outputs depending on inputs for ex: when GSM module/RFID send some output in binary language then it will be processed on Arduino then to get the desired output. GSM module is used for finding a bike when it is lost; it is used for connecting to a smartphone through text messaging. RFID is used as an option for starting a bike’s engine supply when the smartphone is dead or it cannot get connected to a network area

Extended Formulations in Mixed-integer Convex Programming

We present a unifying framework for generating extended formulations for the polyhedral outer approximations used in algorithms for mixed-integer convex programming (MICP). Extended formulations lead to fewer iterations of outer approximation algorithms and generally faster solution times. First, we observe that all MICP instances from the MINLPLIB2 benchmark library are conic representable with standard symmetric and nonsymmetric cones. Conic reformulations are shown to be effective extended formulations themselves because they encode separability structure. For mixed-integer conic-representable problems, we provide the first outer approximation algorithm with finite-time convergence guarantees, opening a path for the use of conic solvers for continuous relaxations. We then connect the popular modeling framework of disciplined convex programming (DCP) to the existence of extended formulations independent of conic representability. We present evidence that our approach can yield significant gains in practice, with the solution of a number of open instances from the MINLPLIB2 benchmark library.Comment: To be presented at IPCO 201

Discreet element modeling of under sleeper pads using a box test

It has recently been reported that under sleeper pads (USPs) could improve ballasted rail track by decreasing the sleeper settlement and reducing particle breakage. In order to find out what happens at the particle-pad interface, discrete element modelling (DEM) is used to provide micro mechanical insight. The same positive effects of USP are found in the DEM simulations. The evidence provided by DEM shows that application of a USP allows more particles to be in contact with the pad, and causes these particles to transfer a larger lateral load to the adjacent ballast but a smaller vertical load beneath the sleeper. This could be used to explain why the USP helps to reduce the track settlement. In terms of particle breakage, it is found that most breakage occurs at the particle-sleeper interface and along the main contact force chains between particles under the sleeper. The use of USPs could effectively reduce particle abrasion that occurs in both of these regions